Can Americans spell the National Spelling Bee's winning words? The BBC challenged Americans to spell words used in the last three Scripps National Spelling Bee competitions. Shrey Parikh, a 14-year-old, won the competition this year after correctly spelling 32 words in a 90-second lighting round tiebreaker. He defeated 12-year-old Ishaan Gupta, who spelled 25 words correctly. Parikh won out against 247 spellers competing in the annual contest, aged between nine and 15, taking home a $52,000 (£39,000) cash prize.

Welcome to our monthly digest, where you can catch up with any AIhub stories you may have missed, peruse the latest news, recap recent events, and more. This month, we learn about AI for science, delve into world models, research transparent and trustworthy AI, and hear about the lottery ticket hypothesis. The latest interview in our series with the AAAI/SIGAI Doctoral Consortium participants featured Ximing Wen who is researching transparent and trustworthy AI systems. We found out more about her work, her experience as a research intern, and what inspired her to study AI. In this wide-ranging conversation, Jonathan Frankle delves into empiricism versus theoretical proofs, how the approach to computer science has changed (even if the fundamental problems haven't), how younger researchers are rapidly adapting to a world that values impact above all else, and what it means to be a researcher.

An ethical hacker who just won major prizes at a prestigious international competition says her days of competing could be numbered due to the rise of AI tools like Claude Mythos. Valentina Palmiotti - better known as Chompie - was the most successful individual at the annual Pwn2Own hacking competition in Berlin. She told BBC News that, for now, AI tools were helping her to win bug bounties - money given to hackers who spot vulnerabilities in online systems before they can be exploited by cyber-criminals. But she said systems like Mythos were so powerful that even champion hackers like her would soon struggle to compete with them. AI has shaken the cyber-security world, with concerns focussing on Mythos in particular.

Improving the performance of deep networks in data-limited regimes has warranted much attention. In this work, we empirically show that "winning tickets" (small subnetworks) obtained via magnitude pruning based on the lottery ticket hypothesis [1], apart from being sparse are also effective recognizers in data-limited regimes. Based on extensive experiments, we find that in low data regimes (datasets of 50-100 examples per class), sparse winning tickets substantially outperform the original dense networks. This approach, when combined with augmentations or fine-tuning from a self-supervised backbone network, shows further improvements in performance by as much as 16% (absolute) on low sample datasets and longtailed classification. Further, sparse winning tickets are more robust to synthetic noise and distribution shifts compared to their dense counterparts. Our analysis of winning tickets on small datasets indicates that, though sparse, the networks retain density in the initial layers and their representations are more generalizable.

I'm standing in front of a quantum computer built out of atoms and light at the UK's National Quantum Computing Centre on the outskirts of Oxford. On a laboratory table, a complex matrix of mirrors and lenses surrounds a Rubik's Cube-size cell where 100 cesium atoms are suspended in grid formation by a carefully manipulated laser beam. The cesium atom setup is so compact that I could pick it up, carry it out of the lab, and put it on the backseat of my car to take home. I'd be unlikely to get very far, though.

Neural Information Processing Systems http://nips.cc/